Least Squares Matrix Algorithm for State-Space Modelling of Dynamic Systems
نویسندگان
چکیده
This work presents a novel least squares matrix algorithm (LSM) for the analysis of rapidly changing systems using state-space modelling. The LSM algorithm is based on the Hankel structured data matrix representation. The state transition matrix is updated without the use of any forgetting function. This yields a robust estimation of model parameters in the presence of noise. The computational complexity of the LSM algorithm is comparable to the speed of the conventional recursive least squares (RLS) algorithm. The knowledge of the state transition matrix enables feasible numerical operators such as interpolation, fractional differentiation and integration. The usefulness of the LSM algorithm was proved in the analysis of the neuroelectric signal waveforms.
منابع مشابه
General Realization Algorithm for Modal Identification of Linear Dynamic Systems
The general realization algorithm GRA is developed to identify modal parameters of linear multi-degree-of-freedom dynamic systems subjected to measured known arbitrary dynamic loading from known initial conditions. The GRA extends the well known eigensystem realization algorithm ERA based on Hankel matrix decomposition by allowing an arbitrary input signal in the realization algorithm. This gen...
متن کاملNEW MODELS AND ALGORITHMS FOR SOLUTIONS OF SINGLE-SIGNED FULLY FUZZY LR LINEAR SYSTEMS
We present a model and propose an approach to compute an approximate solution of Fully Fuzzy Linear System $(FFLS)$ of equations in which all the components of the coefficient matrix are either nonnegative or nonpositive. First, in discussing an $FFLS$ with a nonnegative coefficient matrix, we consider an equivalent $FFLS$ by using an appropriate permutation to simplify fuzzy multiplications. T...
متن کاملImproving adaptive resolution of analog to digital converters using least squares mean method
This paper presents an adaptive digital resolution improvement method for extrapolating and recursive analog-to-digital converters (ADCs). The presented adaptively enhanced ADC (AE-ADC) digitally estimates the digital equivalent of the input signal by utilizing an adaptive digital filter (ADF). The least mean squares (LMS) algorithm also determines the coefficients of the ADF block. In this sch...
متن کاملGlobal least squares solution of matrix equation $sum_{j=1}^s A_jX_jB_j = E$
In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...
متن کاملMonte Carlo Matrix Inversion Policy Evaluation
In 1950, Forsythe and Leibler (1950) introduced a statistical technique for finding the inverse of a matrix by characterizing the elements of the matrix inverse as expected values of a sequence of random walks. Barto and Duff (1994) subsequently showed relations between this technique and standard dynamic programming and temporal differencing methods. The advantage of the Monte Carlo matrix inv...
متن کامل